Predicate abstraction in a program logic calculus
نویسندگان
چکیده
منابع مشابه
Predicate Abstraction in a Program Logic Calculus
Predicate abstraction is a form of abstract interpretation where the abstract domain is constructed from a finite set of predicates over the variables of the program. This paper explores a way to integrate predicate abstraction into a calculus for deductive program verification based on symbolic execution, where it allows us to infer loop invariants automatically that would otherwise have to be...
متن کاملTemporal logic with predicate abstraction
A predicate linear temporal logic LTLλ= without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTLλ= can be naturally seen as the systems of pebbles (flexible constants) moving over the elements of some (possibly infinite) domain. This allows to use LTLλ= for the specification of dynamic systems using some resources, such as processes using memory...
متن کاملPredicate Abstraction for Program Verification
We present basic principles of algorithms for the verification of safety and termination of programs. The algorithms call procedures on logical formulas in order to construct an abstraction and to refine an abstraction. The two underlying concepts are predicate abstraction and counterexampleguided abstraction refinement. UC San Diego · University of Freiburg · Microsoft Research Cambridge · Tec...
متن کاملA Graph Calculus for Predicate Logic
We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents ⊥. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we...
متن کاملPredicate Abstraction for Programmable Logic Controllers
In this paper, we present a predicate abstraction for programs for programmable logic controllers (PLCs) so as to allow for model checking safety related properties. Our contribution is twofold: First, we give a formalization of PLC programs in first order logic, which is then used to automatically derive a predicate abstraction using SMT solving. Second, we employ an abstraction called predica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2011
ISSN: 0167-6423
DOI: 10.1016/j.scico.2010.06.008